TR-2010007: Robust Knowledge of Rationality
نویسنده
چکیده
Stalnaker provided an example of a perfect information game in which common knowledge of rationality does not yield backward induction. However, in his example, knowledge is treated as defeasible: players forfeit their knowledge of rationality at some vertices. This is not how ‘knowledge’ is understood in epistemology where, unlike belief, it is not subject to revision. In this respect, the Stalnaker example is a fit for ‘rationality and common belief of rationality’ rather than ‘common knowledge of rationality.’ In order to represent knowledge in the belief revision setting we introduce the notion of ‘robust knowledge’ which is maintained whenever possible during belief revision. We show that robust knowledge of Stalnaker rationality in games of perfect information yields backward induction.
منابع مشابه
TR-2010010: Robust Knowledge and Rationality
In 1995, Aumann proved that in games of perfect information, common knowledge of rationality yields backward induction. In 1998, Stalnaker provided an example of a game in which common knowledge of rationality, once belief revision is taken into account, does not yield backward induction. However, in some pertinent situations in this example, players are allowed to forfeit the rationality condi...
متن کاملRobust Knowledge of Rationality
Stalnaker provided an example of a perfect information game in which common knowledge of rationality does not yield backward induction. However, in his example, knowledge is treated as defeasible: players forfeit their knowledge of rationality at some vertices. This is not how ‘knowledge’ is understood in epistemology where, unlike belief, it is not subject to revision. In this respect, the Sta...
متن کاملRobust Knowledge and Rationality
In 1995, Aumann proved that in games of perfect information, common knowledge of rationality yields backward induction. In 1998, Stalnaker provided an example of a game in which common knowledge of rationality, once belief revision is taken into account, does not yield backward induction. However, in some pertinent situations in this example, players are allowed to forfeit the rationality condi...
متن کاملTR-2009011: Knowledge-Based Rational Decisions
We outline a mathematical model of rational decision-making based on standard game-theoretical assumptions: 1) rationality yields a payoff maximization given the player’s knowledge; 2) the standard logic of knowledge for Game Theory is the modal logic S5. Within this model, each game has a solution and rational players know which moves to make at each node. We demonstrate that uncertainty in ga...
متن کاملTR-2009006: Intelligent Players
Rational decisions depend on what players know, hence an appropriate epistemic analysis is an integral element of the foundations of Game Theory. We suggest a general logical approach for studying games which consists of formalizing rationality and games in epistemic logic and deriving their properties in the resulting logical system. We study a number of examples and demonstrate that our model...
متن کامل